Convergence of the time-discretized monotonic schemes
نویسندگان
چکیده
منابع مشابه
Convergence of the Time - Discretized Monotonic Schemes
Many numerical simulations in (bilinear) quantum control use the monotonically convergent Krotov algorithms (introduced by Tannor et al. [Time Dependent Quantum Molecular Dynamics (1992) 347–360]), Zhu and Rabitz [J. Chem. Phys. (1998) 385–391] or their unified form described in Maday and Turinici [J. Chem. Phys. (2003) 8191–8196]. In Maday et al. [Num. Math. (2006) 323–338], a time discretizat...
متن کاملLink Monotonic Allocation Schemes
A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any play...
متن کاملLimit points of the monotonic schemes
Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor in [12]), Zhu & Rabitz ([11]) or the general form of Maday & Turinici ([13]). This paper presents an analysis of the limit set of controls provided by these algorithms and a proof of convergence in a particular case.
متن کاملOn Monotonic Convergence to Stability
The paper introduces, for age-distribution population vectors, a class of distances to the stable equivalent; each of these distances converges monotonically to zero as the population approaches stability. The Kullback distance, considered earlier to be unique as a measure with this property, turns out to be a mere specimen of this class. It is shown that the very feature of monotonic convergen...
متن کاملContinuous and Discretized Generalized Pursuit Learning Schemes
A Learning Automaton is an automaton that interacts with a random environment, having as its goal the task of learning the optimal action based on its acquired experience. Many learning automata have been proposed, with the class of Estimator Algorithms being among the fastest ones. Thathachar and Sastry [24], through the Pursuit Algorithm, introduced the concept of learning algorithms. Their a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2007
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an:2007008